Fast State Veri cation
نویسندگان
چکیده
Unique input/output(UIO) sequences are used for state veri cation and functional test in nite state machines. A UIO sequence for a state s distinguishes it from other states in the FSM. Current algorithms to compute UIO sequences are limited in their applicability to FSMs with binary input symbols such as those found in control applications. Execution times of traditional approaches are exponential in the number of FSM inputs. We develop a new heuristic algorithm to generate UIO sequences for FSMs with binary inputs. Execution time is reduced signi cantly by reducing the size of the search space. When a UIO sequence cannot be generated, our algorithm generates a small number of functional faults for state veri cation.
منابع مشابه
Abstraction and Modular Veriication of Innnite-state Reactive Systems ?
ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation o...
متن کاملClassi cation of Dependable Real-time Protocols : A Formal-Methods Perspective for Validation
Computers used for critical applications utilize dependable and real-time protocols to deliver reliable and timely services. The inherently large state-space covered by these protocols limits the e ectiveness of the conventional veri cation and validation (V&V) techniques. A commonly used validation technique is that of fault injection (FI). Although a wide variety of techniques and tools exist...
متن کاملDesign Compiler SYNOPSYS VANTAGE VHDL
We present a solution to the veri cation problem of high-level synthesis. The high-level synthesis system CALLAS takes as input an algorithmic speci cation, in VHDL, and produces as output an EDIF netlist. Both, the speci cation and the generated netlist can be interpreted as nite state machine descriptions. Then, in this context, the veri cation problem is reduced to proving the behavioral equ...
متن کاملImporting the Results of Automatic Hardware Veri cation into HOL
Formal hardware veri cation systems can be split into two categories: theorem proving systems and automatic nite state machine based systems. Each approach has its own complementary advantages and disadvantages. In this paper, we consider the combination of two such systems: HOL (a theorem proving system) and MDG (an automatic system). As HOL hardware veri cation proofs are based on the hierarc...
متن کاملImproved Probabilistic Veri cation by Hash Compaction
We present and analyze a probabilistic method for veri cation by explicit state enumeration, which improves on the \hashcompact" method of Wolper and Leroy. The hashcompact method maintains a hash table in which compressed values for states instead of full state descriptors are stored. This method saves space but allows a non-zero probability of omitting states during veri cation, which may cau...
متن کامل